Hamilton paths in toroidal graphs
نویسندگان
چکیده
Tutte has shown that every 4-connected planar graph contains a Hamilton cycle. Grünbaum and Nash-Williams independently conjectured that the same is true for toroidal graphs. In this paper, we prove that every 4-connected toroidal graph contains a Hamilton path. Partially supported by NSF grant DMS-9970514 Partially supported by NSF grants DMS-9970527 and DMS-0245530 Partially supported by RGC grant HKU7109/01P
منابع مشابه
On the Hamiltonian Laceability of Honeycomb Toroidal Graphs
The Honeycomb toroidal graph is a highly symmetric, vertex-transitive, bipartite graph which has been investigated for certain properties including pan-cyclicity and Hamilton laceability. The main focus of this project was to construct generalised methods for finding Hamilton paths and thus provide a proof of Hamilton laceability for this graph. The resulting proof was successful for a subset o...
متن کاملOn independent domination numbers of grid and toroidal grid directed graphs
A subset $S$ of vertex set $V(D)$ is an {em indpendent dominating set} of $D$ if $S$ is both an independent and a dominating set of $D$. The {em indpendent domination number}, $i(D)$ is the cardinality of the smallest independent dominating set of $D$. In this paper we calculate the independent domination number of the { em cartesian product} of two {em directed paths} $P_m$ and $P_n$ for arbi...
متن کاملHamilton-Laceability of Honeycomb Toriodal graphs
In this paper, we build on the work of Alspach, Chen, and Dean [2] who showed that proving the hamiltonicity of the Cayley graph of the the dihedral group Dn reduces to showing that certain cubic, connected, bipartite graphs (called honeycomb toroidal graphs) are hamilton laceable; that is, any two vertices at odd distance from each other can be joined by a hamilton path. Alspach, Chen, and Dea...
متن کاملFive-Connected Toroidal Graphs Are Hamiltonian
It is well known that not all 3-connected planar graphs are hamiltonian. Whitney [10] proved that every triangulation of the sphere with no separating triangles is hamiltonian. Tutte [9] proved that every 4-connected planar graph has a Hamilton cycle. Extending Tutte's technique, Thomassen [8] proved that every 4-connected planar graph is in fact Hamilton connected. (A small omission in [8] was...
متن کاملMinimum Tenacity of Toroidal graphs
The tenacity of a graph G, T(G), is dened by T(G) = min{[|S|+τ(G-S)]/[ω(G-S)]}, where the minimum is taken over all vertex cutsets S of G. We dene τ(G - S) to be the number of the vertices in the largest component of the graph G - S, and ω(G - S) be the number of components of G - S.In this paper a lower bound for the tenacity T(G) of a graph with genus γ(G) is obtained using the graph's connec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 94 شماره
صفحات -
تاریخ انتشار 2005